P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
51	THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-11-25 03:18:59 Complexity classes Mathematical optimization Structural complexity theory Computability theory P versus NP problem NP-complete NP PP Analog computer Theoretical computer science Computational complexity theory Applied mathematics
52	COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes Analysis of algorithms Mathematical optimization Time complexity Algorithm P NP-complete P versus NP problem Quantum algorithm Theoretical computer science Computational complexity theory Applied mathematics
53	Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2010-11-05 18:41:12 Complexity classes Community websites Mathematical optimization Conjectures P versus NP problem Structural complexity theory Stack Exchange Network NP-complete NP Theoretical computer science Computational complexity theory Applied mathematics
54	Motivation COMS21103 NP-completeness Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes NP-complete NP-hard P versus NP problem NP Cook–Levin theorem Boolean satisfiability problem PP P Theoretical computer science Computational complexity theory Applied mathematics
55	Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY EXERCISE SHEET 1: Turing machines Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2013-10-08 12:31:35 Complexity classes Structural complexity theory Mathematical optimization Analysis of algorithms NP-complete P versus NP problem NP-hard NP Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
56	1 A brief overview of Complexity Theory The following brief overview is intended as a teaser for students in an introductory course on Complexity Theory. Out of the tough came forth sweetness1 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:17 Probabilistic complexity theory Computational complexity theory Mathematical optimization Structural complexity theory NP-complete Complexity NP P versus NP problem Probabilistically checkable proof Theoretical computer science Applied mathematics Complexity classes
57	Computational Complexity Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:18 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP P versus NP problem P Bounded-error probabilistic polynomial Interactive proof system Theoretical computer science Computational complexity theory Applied mathematics
58	Col Space Newsletter of the AUMS Add to Reading List Source URL: www.aums.org.au Language: English - Date: 2013-10-07 19:17:56 Complexity classes Markov processes Markov models Mathematical optimization Structural complexity theory NP-complete Markov chain NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
59	Introduction to Complexity Theory { Lecture Notes Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Email: [removed] July 31, 1999 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2000-12-12 06:50:00 Complexity classes Mathematical optimization Structural complexity theory NP-complete Polynomial-time reduction P versus NP problem NP P-complete Probabilistically checkable proof Theoretical computer science Computational complexity theory Applied mathematics
60	Analysis and Optimality of the Width-w Non-Adjacent Form to Imaginary Quadratic Bases Daniel Krenn (joint work with Clemens Heuberger) Add to Reading List Source URL: www.cant.ulg.ac.be Language: English - Date: 2011-05-31 09:18:08 Operations research Conjectures Mathematical optimization P versus NP problem Structural complexity theory Pi Optimality theory Mathematical analysis Mathematics Mysteries